Prefix routing schemes in dynamic networks

Prefix Routing Schemes in Dynamic Networks

Deadlock-Free Routing In Irregular Networks Using Prefix Routing

In this paper, we propose a deadlock-free routing in irregular networks using pre x routing. Pre x routing is a special type of routing with a compact routing table associated with each node (processor). Basically, each outgoing channel of a node is assigned a special label and an outgoing channel is selected if its label is a pre x of the label of the destination node. Node and channel labelin...

Upper and Lower Bounds for Routing Schemes in Dynamic Networks (Abstract)

We present an algorithm and two lower bounds for the problem of constructing and maintaining routing schemes in dynamic networks. The algorithm distribu-tively assignes addresses to nodes and constructs routing tables in a dynamically growing tree. The resulting routing scheme routes data messages over the shortest path between any source and destination, assigns addresses of O(log 2 n) bits to...

Performance of Dynamic Multi-Layer Routing Schemes in IP+Optical Networks

AbstructThis paper presents two dynamic multi-layer routing policies for optical IP Networks. Both policies first try to allocate a newly requested electrical path to an existing optical path that directly connects the source and destination nodes. If such a path is not available, the two policies employ different procedures. Policy 1, which has been published already, tries to find available e...

Dynamic Localization Schemes in Malicious Sensor Networks

Wireless sensor networks (WSN) have recently shown many potential military and civilian applications, especially those used in hostile environments where malicious adversaries can be present. The accuracy of location information is critical for such applications. It is impractical to have a GPS device on each sensor in WSN due to costs. Most of the existing location discovery schemes can only b...